Multiplicative Distance Functions

نویسنده

  • Christopher D. Sinclair
چکیده

We call φ the root function of Φ. The continuity of Φ implies that (1.2) φ(γ) → |γ| as |γ| → ∞. Moreover the converse is true, if φ is continuous and satisfies this asymptotic formula, then the function Φ formed as in (1.1) is a multiplicative distance function. Theorem 1.1. A continuous function φ : C → [0,∞) is the root function of a multiplicative distance function iff it satisfies (1.2). Arguably the simplest allowable root function is γ 7→ max{1, |γ|}, putting Mahler measure squarely at the center of this theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

متن کامل

Special Functions and the Range of Multiplicative Functions on C[x], R[x] and Z[x]

Mahler’s measure is generalized to create the class of multiplicative distance functions. These functions measure the complexity of polynomials based on the location of their zeros in the complex plane. Several examples of multiplicative distance functions are given including those formed from equilibrium potentials of compact connected subsets of C. To each multiplicative distance function we ...

متن کامل

THE RANGE OF MULTIPLICATIVE FUNCTIONS ON C[x], R[x] AND Z[x]

Mahler’s measure is generalized to create the class of multiplicative distance functions. These functions measure the complexity of polynomials based on the location of their zeros in the complex plane. Following work of S.-J. Chern and J. Vaaler in [1], we associate to each multiplicative distance function two families of analytic functions which encode information about its range on C[x] and ...

متن کامل

Invariant functions for solving multiplicative discrete and continuous ordinary differential equations

In this paper, at first the elemantary and basic concepts of multiplicative discrete and continous differentian and integration introduced. Then for these kinds of differentiation invariant functions the general solution of discrete and continous multiplicative differential equations will be given. Finaly a vast class of difference equations with variable coefficients and nonlinear difference e...

متن کامل

Concrete Multiplicative Complexity of Symmetric Functions

The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f , when only exclusive-or, conjunction and negation gates may be used. This article explores in detail the multiplicative complexity of symmetric Boolean functions. New techniques that allow such exploration are introduced. They a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006